Parallel multigrid summation for the N-body problem

نویسندگان

  • Jesús A. Izaguirre
  • Scott S. Hampton
  • Thierry Matthey
چکیده

An Θ(n) parallel multigrid summation method for the N -body problem is presented. The method works with vacuum or periodic boundary conditions. It is based on a hierarchical decomposition of computational kernels on multiple grids. For low accuracy calculations, appropriate for molecular dynamics, a sequential implementation is faster than both Fast Multipole and Particle Mesh Ewald (PME). Its parallel implementation is more scalable than PME and comparable to the fast multipole. The method can be combined with multiple time stepping integrators to produce a powerful simulation protocol for simulation of biological molecules and other materials. The parallel implementation is based on MPI, and is tested in a variety of clusters and shared memory computers. It is available as open-source in http://protomol.sourceforge.net. An auxiliary tool allows the automatic selection of optimal parameters for given molecular systems and accuracies required, and is available in http://mdsimaid.cse.nd.edu.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding a \treecode" on a Mimd Parallel Computer Using a Domain Decomposition Paradigm. 2. Introduction

1. Abstract \Treecodes" are hierarchical, recursive algorithms which reduce the computational time for the N-body problem from O(N 2), by the direct summation method, to O(N log N) or O(N). This paper contains a description of Treecodes followed by an overview of one Treecode in particular, namely the Greengard-Rokhlin Fast Multipole Method in 2 dimensions. The parallel version of this method i...

متن کامل

A New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm

Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...

متن کامل

A Finite Element Based P3M Method for N-body Problems

In this paper we introduce a new mesh-based method for N-body calculations. The method is founded on a particle-particle–particle-mesh (P3M) approach, which decomposes a potential into rapidly decaying short-range interactions and smooth, mesh-resolvable long-range interactions. However, in contrast to the traditional approach of using Gaussian screen functions to accomplish this decomposition,...

متن کامل

Parallel Multigrid Solvers for 3D Unstructured Finite Element Problems in Large Deformation Elasticity and Plasticity

Multigrid is a popular solution method for the set of linear algebraic equations that arise from PDEs discretized with the nite element method. The application of multigrid to unstructured grid problems, however, is not well developed. We discuss a method, that uses many of the same techniques as the nite element method itself, to apply standard multigrid algorithms to unstructured nite element...

متن کامل

An efficient parallel algorithm for O(N) direct summation method and its variations on distributed-memory parallel machines

We present a novel, highly efficient algorithm to parallelize O(N)direct summation method for N -body problems with individual timesteps on distributed-memory parallel machines such as Beowulf clusters. Previously known algorithms, in which all processors have complete copies of the N -body system, has the serious problem that the communication-computation ratio increases as we increase the num...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Parallel Distrib. Comput.

دوره 65  شماره 

صفحات  -

تاریخ انتشار 2005